Representations of polyadic-like equality algebras
نویسندگان
چکیده
منابع مشابه
Tense like equality algebras
In this paper, first we define the notion of involutive operator on bounded involutive equality algebras and by using it, we introduce a new class of equality algebras that we called it a tense like equality algebra. Then we investigate some properties of tense like equality algebra. For two involutive bounded equality algebras and an equality homomorphism between them, we prove that the tense ...
متن کاملAlgebraic Logic Iv. Equality in Polyadic Algebras
Introduction. A standard way to begin the study of symbolic logic is to describe one after another the propositional calculus, the monadic functional calculus, the pure first-order functional calculus, and the functional calculus with equality. The algebraic aspects of these logical calculi belong to the theories of Boolean algebras, monadic algebras, polyadic algebras, and cylindric algebras r...
متن کاملOn the Equational Theory of Representable Polyadic Equality Algebras
Among others we will see that the equational theory of ! dimensional rep-resentable polyadic equality algebras (RPEA ! 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is nite schema-axiomatizable (and hence the equational theory of this class is nite schema-axi...
متن کاملReducts of Polyadic Equality Algebras without the Amalgamation Property
Let G ⊆ ω be a monoid such that {[i|j ] : i, j ∈ ω} ⊆ G. Let RPEAG be the reduct of representable polyadic equality algebras obtained by restricting the similarity type of RPEAω to substitutions in G and PEAG be the class of abstract polyadic algebras obtained from PEAω by restricting the similarity type and axiomatization of PEAω to substitutions in G and to finite quantifiers. Assume that G c...
متن کاملAmalgamation for Reducts of Polyadic Equality Algebras, a Negative Result
Let G ⊆ ω be a semigroup. G polyadic algebras with equality, or simply G algebras, are reducts of polyadic algebras with equality obtained by restricting the similarity type and axiomatization of polyadic algebras to substitutions in G, and possibly weakening the axioms governing diagonal elements. Such algebras were introduced in the context of ’finitizing’ first order logic with equality. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra universalis
سال: 2015
ISSN: 0002-5240,1420-8911
DOI: 10.1007/s00012-015-0360-1